منابع مشابه
Recasting MLF
The language MLF has been proposed as an alternative to System F that permits partial type inference a la ML. It differs from System F by its types and type-instance relation. Unfortunately, the definition of type instance is only syntactic, and not underpinned by some underlying semantics. It has so far only been justified a posteriori by the type soundness result. In this work, we revisit MLF...
متن کاملRecasting the Elliott Conjecture
Let A be a simple, unital, finite, and exact C-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup which is obtained from the Elliott invariant in a functorial manner. We conjecture that this embedding is an isomorphism, and prove the conjecture in several cases. In these same cases — Z-stab...
متن کاملRecasting biomolecules for function.
D the holiday season, transformations abound. At the end of the year, my family, friends, and colleagues parade in their ugly sweaters or their New Year’s Eve party-wear. I was thinking about how these adornments can influence our circle of interactions. As a tangible example, my colleague George Phillips attracted a crowd with his prize-winning sweater (Figure 1). Our first issue of 2012 also ...
متن کاملNotes for pipelines of transformations for MLF
These notes attempt to survey basic manipulations that can be done to a ML functional program prior to compilation. The paper does not consider transformations for improvement of the code but it only considers manipulations of the source text which can allow the compiler to do a better job. Which manipulationto choose depends on the target language. The survey can be useful for answering the ab...
متن کاملA Church-Style Intermediate Language for MLF
MLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System-F explicit first-class polymorphism. We present xMLF, a Church-style version of MLF with full type information that can easily be maintained during reduction. All parameters of functions are explicitly typed and both type abstraction and type instantiation are explicit. However, type instanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2009
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.12.006